Multisearch Techniques: Parallel Data Structures on Mesh-Connected Computers
نویسندگان
چکیده
The multisearch problem is de ned as follows. Given a data structure D modeled as a graph with n constant-degree nodes, performO(n) searches on D. Let r be the length of the longest search path associated with a search process, and assume that the paths are determined \on-line". That is, the search paths may overlap arbitrarily. In this paper, we solve the multisearch problem for certain classes of graphs in O( p n+r p
منابع مشابه
A Fast Algorithm for Image Component Labeling with Local Operators on Mesh Connected Computers
A new parallel algorithm for image component labeling with local operators on SIMD mesh connected computers is presented. This algorithm provides a positive answer to the open question whether there exists an O(n)–time and O(log n)–space local labeling algorithm on SIMD mesh connected computers. The algorithm uses a pipeline mechanism with stack–like data structures to achieve the lower bound o...
متن کاملMultisearch Techniques of Hierarchical DAGs on Mesh-Connected Computers, with Applications
We present a technique for optimally performing n searches of an n-vertex hierarchical DAG on Mesh-Connected Computers. As immediate consequences of this. we obtain the first optimal mesh algorithms for the problems of computing the convex: hull of a. set of 3-dimensional points, and of computing the intersection of two 3-dimensional convex polyhedra. The best previously known bounds for these ...
متن کاملBlocking in Parallel Multisearch
External memory (EM) algorithms are designed for computational problems in which the size of the internal memory of the computer is only a small fraction of the problem size. Block-wise access to data is a central theme in the design of eecient EM algorithms. A similar requirement arises in the transmission of data between processors in certain parallel computation models such as BSP* and CGM, ...
متن کاملFFTs on Mesh Connected Computers
The most eeective use of mesh connected computers is achieved by paying careful attention to the organization of the storage and movement of data. For an important class of algorithms the formalization of the different operations they perform lead to an uniied treatment for them and may result in important simpliications. In this work we apply this point of view to the Fast Fourier Transform (F...
متن کاملHigh Performance Multigrid on Current Large Scale Parallel Computers
Making multigrid algorithms run efficiently on large parallel computers is a challenge. Without clever data structures the communication overhead will lead to an unacceptable performance drop when using thousands of processors. We show that with a good implementation it is possible to solve a linear system with 10 unknowns in about 1.5 minutes on almost 10,000 processors. The data structures al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 20 شماره
صفحات -
تاریخ انتشار 1994